A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
نویسندگان
چکیده
Competitive Searching in Polygons Beyond Generalised Streets p. 32 Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas p. 42 Logspace Verifiers, NC, and NP p. 52 Structure in Average Case Complexity p. 62 Some Geometric Lower Bounds p. 72 The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation p. 82 Two Arc Disjoint Paths in Eulerian Diagraphs p. 92 Finding Dense Subgraphs p. 102 Finding Smallest Supertrees p. 112 Weighted Domination of Cocomparability Graphs p. 122 The Parallel Complexity of Approximating the High Degree Subgraph Problem p. 132 Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs p. 142
منابع مشابه
Interval Representations of 2-Monotonic and Threshold Boolean Functions
Threshold, 2-monotonic and interval Boolean functions constitute special classes of Boolean functions for which it is easy to decide many problems which are intractable for general Boolean functions. In our article we show that positive interval functions are a proper subset of positive threshold functions. Then we prove one property of 2-monotonic functions which is related to testing whether ...
متن کاملPolynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
We consider the problem of identifying an unknown Boolean function f by asking an oracle the functional values f(a) for a selected set of test vectors a ∈ {0, 1}n. Furthermore, we assume that f is a positive (or monotone) function of n variables. It is not known yet whether the whole task of generating test vectors and checking if the identification is completed can be carried out in polynomial...
متن کاملReliability assessment of power distribution systems using disjoint path-set algorithm
Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...
متن کاملA Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کاملA Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995